#
# @lc app=leetcode.cn id=167 lang=python3
#
# [167] 两数之和 II - 输入有序数组
#

# @lc code=start
class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        hashMap = {}
        for index, num in enumerate(numbers):
            another_num = target - num
            if another_num in hashMap:
                return [hashMap[another_num] + 1, index + 1]
            hashMap[num] = index
        return None
# @lc code=end

